Recovering Cyclic Schedules Using Dynamic Produce-Up-To Policies

نویسنده

  • Donald D. Eisenstein
چکیده

We consider facilities that follow a cyclic schedule to replenish the inventory of a set of items through production by a shared resource. We introduce a dynamic produce-up-to policy that recovers the target cyclic schedule after a single disruption, and is also shown to be effective when disruptions are more frequent. Our policy is more flexible than traditional recovery policies in that our policy is able to adjust the amount of idle time observed during recovery in response to disruptions, and yet re-establish the target idle time as the schedule recovers. This results in a policy that not only saves cost and time, but provides better schedule stability than other recovery procedures. Furthermore, unlike simple produce-up-to policies, our policy is anticipatory—replenishments will be speeded up or delayed, whichever is necessary, to help avoid congestion at the shared resource. In addition, recovery is controlled by a single “knob” or parameter that can tune recovery to be fast and aggressive (frequent setups and small batches) or slow and methodical (few setups and larger batches). Finally, our policy is easy to implement, augmenting a traditional produce-up-to policy with a simple set of counters that control replenishment decisions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality and Existence of Optimal Policies in Generalized Joint Replenishment

We establish a duality theory for a broad class of deterministic inventory control problems on continuous spaces that includes the classical joint replenishment problem and inventory routing. Using this theory, we establish the existence of an optimal policy, which has been an open question. We show how a primal-dual pair of infinite dimensional linear programs encode both cyclic and non-cyclic...

متن کامل

Cyclic Scheduling

In this paper we consider the problem of cyclic schedules such as arise in manufacturing. We introduce a new formulation of this problem that is a very simple modi cation of a standard job shop scheduling formulation, and which enables us to use existing constraint reasoning techniques to generate cyclic schedules. We present evidence for the e ectiveness of this formulation, and describe exten...

متن کامل

Scheduling Batch Processing Machines in Complex Job Shops

This paper considers a complex job shop problem with reentrant flow and batch processing machines. A modified shifting bottleneck heuristic (MSB) is considered for generating machine schedules to minimize the total weighted tardiness. We observe that the MSB could produce infeasible schedules where cyclic schedules are found. A cycle elimination procedure is proposed to remove the possibility o...

متن کامل

On Cyclic Plans for Scheduling a Smart Card Personalisation System

An industrial case study for scheduling the personalisation of smart cards is presented and analysed. Smart cards are personalised in several machines that are served by an underlying conveyor belt connecting these. As there are usually a very high number of smart cards to be personalised, the focus is on cyclic schedules and the goal is to obtain a plan with high throughput. By characterizing ...

متن کامل

Dominance of Cyclic Solutions and Challenges in the Scheduling of Robotic Cells

We consider the problem of scheduling operations in bufferless robotic cells that produce identical parts. Maximizing the long-term average throughput of parts is an important problem in both theory and practice. We define an appropriate state space required to analyze this problem and show that cyclic schedules which repeat a fixed sequence of robot moves indefinitely are the only ones that ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Operations Research

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2005